General minisum circle location
نویسندگان
چکیده
In our paper we approximate a set of given points by a general circle. More precisely, we consider the problem of locating and scaling the unit ball of some given norm k1 with respect to fixed points on the plane such that the sum of weighted distances between the circle and the fixed points is minimized, where the distance is measured by a norm k2. We present results for the general case. In the case that k1 and k2 are both block norms, we are able to identify a finite dominating set in R for the problem, which can be obtained as the intersection of cones.
منابع مشابه
Feedback Algorithm for the Single-Facility Minisum Problem
A new accelerated algorithm to solve the single-facility minisum location problem is developed. The acceleration is achieved using a feedback factor. The proposed algorithm converges faster than the accelerating procedures available in the literature. Being nearly as simple as the classical Weiszfeld procedure, the new method can easily be implemented in real applications. Practical subroutines...
متن کاملMinisum and Minimax Location Models for Helicopter Emergency Medical Service Systems
This paper presents minisum and minimax location problems for helicopter emergency medical service (HEMS) systems. Given demand points (origins) and hospitals (destinations), the locations of rendezvous points and helicopter stations are selected to minimize the total demand-weighted transport time (minisum objective) and the maximum transport time (minimax objective) to a hospital. Rendezvous ...
متن کاملon Convergence in the Single Facility
-The single facility minisum location problem requires finding a point in ~N that minimizes a sum of weighted distances to m given points. The distance measure is typically assumed in the literature to be either Euclidean or rectangular, or the more general Ip norm. Global convergence of a well-known iterative solution method named the Weiszfeld procedure has been proven under the proviso that ...
متن کاملBicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives
We present a new model, which is a generalization of the bicriterion median problem. We introduce two sum objectives and criteria dependent edge lengths. For this NP complete problem a solution method nding all the eÆcient solutions is presented. The method is a two-phases approach, which can easily be applied as an interactive method. In Phase 1 the supported solutions are found, and in Phase ...
متن کاملAn Investigation on Multi-Criteria Location Problem with Fuzzy Parameters
This paper considers to locate multiple new uncapacitated facilities on a plane bounded by a convex polygon under minisum, maximin and minimax criteria to meet fuzzy demands of customers. Some fuzzy programming models are initiated for this problem, where Euclidean distances are assumed as the scenario. And a hybrid intelligent algorithm is designed for solving the proposed models.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009